An Improved Upper Bound for TSP in Cubic 3-Connected Graphs
نویسندگان
چکیده
We consider the classical minimum Travelling Salesman Problem on the class of 3-edge-connected cubic graphs. More specifically we consider their (shortest path) metric completions. The well-known conjecture states that the subtour elimination LP relaxation on the min TSP yields a 4/3 approximation factor, yet the best known approximation factor is 3/2. The 3-edge-connected cubic graphs are interesting because of their connection of the optimal solution to the subtour elimination LP relaxation. One main result is an approximation algorithm for the minimum TSP on this class of graphs with an approximation factor better than the general 3/2.
منابع مشابه
An improved upper bound for the TSP in cubic 3-edge-connected graphs
We consider the travelling salesman problem (TSP) problem on (the metric completion of) 3-edge-connected cubic graphs. These graphs are interesting because of the connection between their optimal solutions and the subtour elimination LP relaxation. Our main result is an approximation algorithm better than the 3/2-approximation algorithm for TSP in general. © 2004 Elsevier B.V. All rights reserved.
متن کاملTSP on Cubic and Subcubic Graphs
We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says that the integrality gap, i.e., the worst case ratio between the optimal values of the TSP and its linear programming relaxation, is 4/3. Using polyhedral tec...
متن کاملA new upper bound for the traveling salesman problem in cubic graphs
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i. e. graphs with maximum vertex degree three, and prove that the problem for an n-vertex graph can be solved inO(1.2553) time and in linear space. We show that the exact TSP algorithm of Eppstein, with some minor modifications, yields the stated result. The previous best known upper bound O(1.251) was claimed by...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملTSP Tours in Cubic Graphs: Beyond 4/3
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in particular that the integrality gap of the subtour LP is at most 4/3 for cubic 2-connected graphs and matching the conjectured value of the famous 4/3 conjectu...
متن کامل